Determining Optimum Queue Length in Computer Networks by Using Memetic Algorithms
نویسندگان
چکیده
منابع مشابه
Lamarckian memetic algorithms: local optimum and connectivity structure analysis
Memetic Algorithms (MAs) represent an emerging field that has attracted increasing research interest in recent times. Despite the popularity of the field, we remain to know rather little of the search mechanisms of MAs. Given the limited progress made on revealing the intrinsic properties of some commonly used complex benchmark problems and working mechanisms of Lamarckian memetic algorithms in...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
A Multi - objective Design of Communication Networks Using Memetic Algorithms
Evolutionary Algorithms (EAs) represent an elegant class of solution paradigms that can efficiently tackle NP-hard problems such as network design problems. The most widely used of these EAs is genetic algorithm (GA). However, GA is prone to premature convergence making it unable to search numerous solutions of the problem domain. A memetic algorithm (MA) which is a symbiosis of GA and local se...
متن کاملOptimizing Multiple Objectives on Multicast Networks using Memetic Algorithms
In this paper, we propose the use of Memetics Algorithms for solving multiobjective network problems. The aim is to minimize total delay and total hop count on sending a multicast flow through a network. We propose a heuristic that avoid the creation of subgraphs for finding paths. The heuristic combined with multiobjective evolutionary algorithms have shown similar results to the results obtai...
متن کاملQueue-length synchronization in communication networks.
We study the synchronization in the context of network traffic on a 2-d communication network with local clustering and geographic separations. The network consists of nodes and randomly distributed hubs where the top five hubs ranked according to their coefficient of betweenness centrality (CBC) are connected by random assortative and gradient mechanisms. For multiple message traffic, messages...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2009
ISSN: 1812-5654
DOI: 10.3923/jas.2009.2847.2851